Self-dual embeddings of complete bipartite graphs
نویسندگان
چکیده
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملClassification of nonorientable regular embeddings of complete bipartite graphs
A 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is called regular if its automorphism group acts regularly on the flags mutually incident vertex-edge-face triples. In this paper, we classify the regular embeddings of complete bipartite graphs Kn,n into nonorientable surfaces. Such a regular embedding of Kn,n exists only when n = 2p a1 1 p a2 2 · · · p ak k (a...
متن کاملRegular embeddings of complete bipartite graphs: classification and enumeration
The regular embeddings of complete bipartite graphs Kn,n in orientable surfaces are classified 5 and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in the cases where n is a prime power, obtained in collaboration with Du, Kwak, Nedela and Škoviera, together with results of Itô, Hall, Huppert and Wielandt on fa...
متن کاملLinks inside Straight-Edge Embeddings of Complete Bipartite Graphs
We prove the following theorem. Let L be any link. There is some N = NL such that every straight-edge embedding of the complete bipartite graph KN,N contains a finite union of cycles having link type L. This result builds on the ideas of S. Negami, who proved the analogous result for complete graphs. Most of our motivation for this paper is to give a simpler proof of Negami’s Theorem.
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1992
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90056-4